Mining association rules with negative item constraints.
نویسندگان
چکیده
منابع مشابه
Mining Association Rules with Item Constraints
The problem of discovering association rules has received considerable research attention and several fast algorithms for mining association rules have been developed. In practice, users are often interested in a subset of association rules. For example, they may only want rules that contain a speci c item or rules that contain children of a speci c item in a hierarchy. While such constraints c...
متن کاملAn Efficient Method for Mining Association Rules with Item Constraints
Most existing studies on association rules discovery focused on finding the association rules between all items in a large database that satisfy user-specified minimum confidence and support. In practice, users are often interested in finding association rules involving only some specified items. Meanwhile, based on the search results in former queries, users tend to change the minimal confiden...
متن کاملMining Association Rules with Uncertain Item Relationships
In order to enhance the precision in association rule mining, an extension is proposed to capture the uncertain item relationships in the data sets in this paper. Two sources of uncertainty are considered: the degree of individual item importance (multiplicity) and the degree of association among the items (inter-relationship). In many real-world applications, especially in a distributed enviro...
متن کاملMining negative association rules
The focus of this paper is the discovery of negative association rules. Such association rules are complementary to the sorts of association rules most often encountered in literatures and have the forms of X→¬Y or ¬X→Y. We present a rule discovery algorithm that finds a useful subset of valid negative rules. In generating negative rules, we employ a hierarchical graph-structured taxonomy of do...
متن کاملMining Class-Association Rules with Constraints
Numerous fast algorithms for mining class-association rules (CARs) have been developed recently. However, in the real world, end-users are often interested in a subset of class-association rules. Particularly, they may consider only rules that contain a specific item or a specific set of items. The nave strategy is to apply such item constraints into the post-processing step. However, such appr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science and Cybernetics
سال: 2012
ISSN: 1813-9663,1813-9663
DOI: 10.15625/1813-9663/25/4/584